On elliptic curves in characteristic 2 with wild additive reduction
نویسندگان
چکیده
منابع مشابه
On elliptic curves in characteristic 2 with wild additive reduction
Introduction. In [Ge1] Gekeler classified all elliptic curves over F2r (T ) with one rational place of multiplicative reduction (without loss of generality located at ∞), one further rational place of bad reduction (without loss of generality located at 0) and good reduction elsewhere. So these curves have conductor ∞ · T where n is a natural number (which actually can be arbitrarily large). In...
متن کاملIwasawa L-Functions of Elliptic Curves with Additive Reduction
9] Perrin-Riou, B.: Descente innnie et hauteur p-adique sur les courbes elliptiques a multiplication complexe.
متن کاملEfficient Arithmetic on Elliptic Curves in Characteristic 2
We present normal forms for elliptic curves over a field of characteristic 2 analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient algorithms for point addition and scalar multiplication on these forms. The resulting algorithms apply to any elliptic curve over a field of characteristic 2 with a ...
متن کاملCANONICAL HEIGHTS ON ELLIPTIC CURVES IN CHARACTERISTIC p
Let k = Fq(t) be the rational function field with finite constant field and characteristic p ≥ 3, and let K/k be a finite separable extension. For a fixed place v of k and an elliptic curveE/K which has ordinary reduction at all places ofK extending v, we consider a canonical height pairing 〈 , 〉v : E(K ) × E(K) → C v which is symmetric, bilinear and Galois equivariant. The pairing 〈 , 〉∞ for t...
متن کاملCounting points on elliptic curves in medium characteristic
In this paper, we revisit the problem of computing the kernel of a separable isogeny of degree ` between two elliptic curves defined over a finite field Fq of characteristic p. We describe an algorithm the asymptotic time complexity of which is equal to e O(`(1 + `/p) log q) bit operations. This algorithm is particularly useful when ` > p and as a consequence, we obtain an improvement of the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1999
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-91-2-171-180